﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion

using NUnit.Framework;
using NStl.Collections;
using NUnit.Framework.SyntaxHelpers;
using System.Collections.Generic;
using System;

namespace NStl.NUnit.ContainerFixture.HashMap
{
    [TestFixture]
    public class EraseFixture
    {
        private List<KeyValuePair<int, string>> refList;
        private HashMap<int, string> hm;
        [SetUp]
        public void SetUp()
        {
            refList = new List<KeyValuePair<int, string>>(new KeyValuePair<int, string>[]
                       {
                           new KeyValuePair<int, string>(0, "asfsa"),                                        
                           new KeyValuePair<int, string>(1, "sfas"),
                           new KeyValuePair<int, string>(2, "hgff"),
                           new KeyValuePair<int, string>(3, "zughk"),
                           new KeyValuePair<int, string>(4, "sdgfsdg"),
                           new KeyValuePair<int, string>(5, "sdgfsd"),
                        });


            hm = new HashMap<int, string>(refList);
        }
        [Test]
        public void EraseKey()
        {
            KeyValuePair<int, string> toRemove = refList[2];
            refList.RemoveAt(2);

            bool rv = hm.Erase(toRemove.Key);
            Assert.That(rv, Is.True);
            Assert.That(hm, Is.EquivalentTo(refList));
        }
        [Test]
        public void EraseKeyFails()
        {
            bool rv = hm.Erase(42);
            Assert.That(rv, Is.False);
            Assert.That(hm, Is.EquivalentTo(refList));
        }
        [Test]
        [ExpectedException(typeof(ArgumentNullException))]
        public void EraseKeyFailsWithNull()
        {
            HashMap<string, string> hashmap = new HashMap<string,string>();
            hashmap.Erase((string) null);
        }

        [Test]
        public void EraseIterator()
        {
            refList.RemoveAt(2);

            HashMap<int, string>.Iterator where = hm.Find(2);

            bool rv = hm.Erase(where);

            Assert.That(rv, Is.True);
            Assert.That(hm, Is.EquivalentTo(refList));
        }
        [Test]
        public void EraseIteratorFails()
        {
            HashMap<int, string>.Iterator where = hm.Find(42);

            bool rv = hm.Erase(where);

            Assert.That(rv, Is.False);
            Assert.That(hm, Is.EquivalentTo(refList));
        }
        [Test]
        [ExpectedException(typeof(ArgumentNullException))]
        public void EraseIteratorIsNullFails()
        {
            Assert.That(hm.Erase(null), Is.False);
            Assert.That(hm, Is.EquivalentTo(refList));
        }

        [Test]
        public void EraseRange()
        {
            Vector<KeyValuePair<int, string>> content = new Vector<KeyValuePair<int, string>>(hm.ToArray());

            Vector<KeyValuePair<int, string>>.Iterator first = content.Begin() + 2;
            Vector<KeyValuePair<int, string>>.Iterator last = content.Begin() + 4;
            
            content.Erase(first, last);


            HashMap<int, string>.Iterator hmFirst = NStlUtil.Advance<KeyValuePair<int, string>, HashMap<int, string>.Iterator>(hm.Begin(), 2);
            HashMap<int, string>.Iterator hmLast  = NStlUtil.Advance<KeyValuePair<int, string>, HashMap<int, string>.Iterator>(hm.Begin(), 4);

            hm.Erase(hmFirst, hmLast);

            Assert.That(hm, Is.EquivalentTo(content));
        }
    }
}
